Current Issue : January-March Volume : 2024 Issue Number : 1 Articles : 5 Articles
Feature selection entails choosing the significant features among a wide collection of original features that are essential for predicting test data using a classifier. Feature selection is commonly used in various applications, such as bioinformatics, data mining, and the analysis of written texts, where the dataset contains tens or hundreds of thousands of features, making it difficult to analyze such a large feature set. Removing irrelevant features improves the predictor performance, making it more accurate and cost-effective. In this research, a novel hybrid technique is presented for feature selection that aims to enhance classification accuracy. A hybrid binary version of sideblotched lizard algorithm (SBLA) with genetic algorithm (GA), namely SBLAGA, which combines the strengths of both algorithms is proposed. We use a sigmoid function to adapt the continuous variables values into a binary one, and evaluate our proposed algorithm on twenty-three standard benchmark datasets. Average classification accuracy, average number of selected features and average fitness value were the evaluation criteria. According to the experimental results, SBLAGA demonstrated superior performance compared to SBLA and GA with regards to these criteria. We further compare SBLAGA with four wrapper feature selection methods that are widely used in the literature, and find it to be more efficient....
As one of the key focuses in 6G research, the space–air–ground integrated network incorporates a variety of technological frameworks. Network function virtualization allows network functions to be deployed on general servers in the form of software and creates a service function chain (SFC) according to user service requirements. In recent years, the deployment of SFC has become popular research due to the increasing demand for low delay in network application scenarios. Low delay is a crucial indicator of the quality of service, especially for delay-sensitive applications. To address this issue, we propose a method for the deployment of delay-sensitive SFC based on parallelization and the improved cuckoo search (ICS) algorithm (DDSSFC-PICS). This method optimizes the composition and deployment of SFC jointly. First, the serial structure of the SFC is transformed into a parallel structure by determining the dependency of virtual network functions, which reduces the length of the SFC and thereby reduces delay. Second, with the optimization goal of minimizing network delay, a parallel SFC deployment model is established under constraints including packet loss rate and resource availability. Finally, the ICS algorithm is applied for optimization, where delay is used as the fitness measure. By improving the Lévy flight step size and drawing inspiration from the whale algorithm, the performance of the cuckoo search (CS) algorithm is enhanced, leading to a further reduction in delay. The simulation results show that using the same CS deployment method, parallelized SFC has a significantly lower delay compared to serial SFC. Furthermore, the DDSSFC-PICS reduces the delay by 22.58% and 19.02%, respectively, compared with the CS deployment and particle swarm optimization SFC deployment methods....
Reasonable planning of travel routes can keep people away from crowded areas and reduce the probability of contracting the COVID-19. In view of the characteristics related to virus infection and human flow density, it can overcome the shortcomings of using the same pheromone initial value and slow initial convergence in route planning of ant colony optimization (ACO) algorithm. In this paper, the decision tree algorithm is used to divide the human flow density into three levels: high risk, medium risk, and low risk; and different pheromone volatility coefficients are set to change the distribution of pheromone concentration. The experimental results show that the improved ACO algorithm could help to reduce the likehood of passing through the medium-risk areas and the high-risk areas, which is reduced to less than 1%. This scheme provides an efficient route planning method for epidemic prevention and control that can be applied in the daily prevention of COVID-19 in universities....
In view of the poor timeliness of dynamic blood glucose data and a delay of insulin effect for blood glucose control, and considering the nonlinearity and nonstationarity of the glucose data, a new blood Glucose Prediction algorithm combined Correlation coefficient-based complete ensemble empirical mode decomposition with adaptive noise and back propagation neural network (GPCEMBP) was proposed to increase the prediction time and improve the prediction accuracy. It refined the mode decomposition algorithm and integrated the correlation mode filter function to extract the characteristic intrinsic mode functions from the original signal. A new neural network prediction model was constructed by optimizing the number of hidden layer neurons, the number of hidden layers, activation functions, the number of inputs, structure, and other parameters. Finally, a predicted blood glucose value was calculated by phase space reconstruction technology. Through ablation and comparison experiments, it was demonstrated that the GPCEMBP algorithm had better prediction accuracy, convergence, and robustness in blood glucose prediction within 84 min. In addition, it has good adaptability to deal with different quality glucose data....
For the traditional A* algorithm has problems such as long paths, large number of nodes, and the demand for dynamic obstacle cannot be avoided in complex environment. A mobile robot dynamic path avoidance method will be improved to improve the A* algorithm and improve DWA algorithm Two map environments are used for simulation verification. First, the evaluation function and key node selection strategy are optimized for the A* algorithm, and redundant nodes are deleted; then the dynamic obstacle distance evaluation function is added to the DWA algorithm which for the purpose of the obstacle avoidance performance can be enhanced. The results about the improved A* algorithm reduces 12.20% and 58.33% in path length and number of turning points respectively compared with the traditional A* algorithm can be obviously grasped by the simulation experiment; by using the fusion algorithm whose purpose of using arcs instead of the straight lines is to turn more smoothly, and can be closest to the global optimum while avoiding dynamic obstacles to complete the search....
Loading....